Ùùð Óòøóùööòòò Ììì Ëë Blockinööø Ëëù

This paper provides several contributions related to dual contouring implicit data including solving rank deficient QEF’s, reducing memory requirements, and performing fast polygon updates during CSG. First, we describe our method for solving QEF’s and provide a method using mass points that improves vertex placement in the rank deficient case. This improvement leads to a technique for handling vertex placement in the presence of non-manifold sign configurations. Next, we provide a method for reducing the space requirements for storing the implicit data needed to generate the contour. Finally, we describe our method for storing the geometry data in a format suitable for fast display on modern graphics hardware as well as techniques updating the data-structure in constant time during CSG operations.